Theoretical computer science

Results: 9916



#Item
112009 Godel Prize The 2009 G¨odel Prize for outstanding papers in the area of theoretical computer science is awarded to (1) Entropy waves, the zig-zag graph product and new constant degree expanders, Omer Reingold, Sal

2009 Godel Prize The 2009 G¨odel Prize for outstanding papers in the area of theoretical computer science is awarded to (1) Entropy waves, the zig-zag graph product and new constant degree expanders, Omer Reingold, Sal

Add to Reading List

Source URL: eatcs.org

Language: English - Date: 2016-09-14 05:19:11
    12Faculty of Engineering Distinguished Lecture Hosted by Institute of Theoretical Computer Science and Communications Information and Entropy Flow in Stochastic Control Prof. Sanjoy Mitter

    Faculty of Engineering Distinguished Lecture Hosted by Institute of Theoretical Computer Science and Communications Information and Entropy Flow in Stochastic Control Prof. Sanjoy Mitter

    Add to Reading List

    Source URL: www.itcsc.cuhk.edu.hk

    Language: English - Date: 2018-01-18 20:17:11
      13Structural sparsity in the real world Erik Demaine∗ , Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Blair D. Sullivan† and Somnath Sikdar Theoretical Computer Science ∗ MIT † NCSU

      Structural sparsity in the real world Erik Demaine∗ , Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Blair D. Sullivan† and Somnath Sikdar Theoretical Computer Science ∗ MIT † NCSU

      Add to Reading List

      Source URL: tcs.rwth-aachen.de

      Language: English - Date: 2015-02-27 18:04:04
        14Besprechung der zweiten Praxisaufgabe Christoph Scheben Institute for Theoretical Computer Science (ITI) 1

        Besprechung der zweiten Praxisaufgabe Christoph Scheben Institute for Theoretical Computer Science (ITI) 1

        Add to Reading List

        Source URL: i12www.ira.uka.de

        Language: German - Date: 2014-03-03 09:49:16
          15Published in Theoretical Computer Science, 645: 1–24, Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short sharesI Benoˆıt Libert Ecole Normale Su

          Published in Theoretical Computer Science, 645: 1–24, Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short sharesI Benoˆıt Libert Ecole Normale Su

          Add to Reading List

          Source URL: joye.site88.net

          Language: English - Date: 2016-09-03 11:29:55
            16Constraint Programming: In Pursuit of the Holy Grail Roman Barták Charles University, Faculty of Mathematics and Physics, Department of Theoretical Computer Science Malostranské námûstí 2/25, Praha 1, Czech R

            Constraint Programming: In Pursuit of the Holy Grail Roman Barták Charles University, Faculty of Mathematics and Physics, Department of Theoretical Computer Science Malostranské námûstí 2/25, Praha 1, Czech R

            Add to Reading List

            Source URL: kti.mff.cuni.cz

            Language: English - Date: 1999-12-06 11:36:48
              17Structural sparsity in the real world Felix Reidl Theoretical Computer Science @abc-Workshop 2015

              Structural sparsity in the real world Felix Reidl Theoretical Computer Science @abc-Workshop 2015

              Add to Reading List

              Source URL: tcs.rwth-aachen.de

              Language: English - Date: 2015-11-04 10:10:45
                18Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org LOWER BOUNDS FOR ADAPTIVE LINEARITY TESTS SHACHAR LOVETT Faculty of Mathematics and Computer Science

                Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org LOWER BOUNDS FOR ADAPTIVE LINEARITY TESTS SHACHAR LOVETT Faculty of Mathematics and Computer Science

                Add to Reading List

                Source URL: drops.dagstuhl.de

                Language: English - Date: 2008-02-05 07:56:01
                  19Theoretical Computer Science–534 www.elsevier.com/locate/tcs On the robustness of interconnections in random graphs: a symbolic approach 

                  Theoretical Computer Science–534 www.elsevier.com/locate/tcs On the robustness of interconnections in random graphs: a symbolic approach 

                  Add to Reading List

                  Source URL: algo.inria.fr

                  Language: English - Date: 2007-05-05 13:16:03
                    20CS 286A-2 Mathematical Methods in Theoretical Computer Science Fall 2008

                    CS 286A-2 Mathematical Methods in Theoretical Computer Science Fall 2008

                    Add to Reading List

                    Source URL: users.cms.caltech.edu

                    Language: English - Date: 2008-09-30 13:48:49